Grobner Bases Method for Biometric Traits Identification and Encryption
نویسندگان
چکیده
منابع مشابه
Grӧbner Bases Method for Biometric Traits Identification and Encryption
Biometric identification systems are principally related to the information security as well as data protection and encryption. The paper proposes a method to integrate biometrics data encryption and authentication into error correction techniques. The normal methods of biometric templates matching are replaced by a more powerful and high quality identification approach based on Grӧbner bases c...
متن کاملGrobner-shirshov Bases for Representation Theory
In this paper, we develop the Gr6bner-Shirshov basis theory for the representations of associative algebras by introducing the notion of Gr6bner-Shirshov pairs. Our result can be applied to solve the reduction problem in representation theory and to construct monomial bases of representations of associative algebras. As an illustration, we give an explicit construction of Gr6bner-Shirshov pairs...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملBiometric cryptosystems: authentication, encryption and signature for biometric identities
Zusammenfassung) Biometrics have been used for secure identification and authentication for more than two decades since biometric data is unique, non-transferable, unforgettable, and always with us. Recently, biometrics has pervaded other aspects of security applications that can be listed under the topic of “Biometric Cryptosystems”. Although the security of some of these systems is questionab...
متن کاملMiddle-Solving Grobner bases algorithm for cryptanalysis over finite fields
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Gröbner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Gröbner bases based algebraic attacks, namely, any information won’t be got if we couldn’t work out the Gröbner bases of the polynomial equations system. In this paper, firstly, a gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Security
سال: 2015
ISSN: 2153-1234,2153-1242
DOI: 10.4236/jis.2015.63024